Pseudo-Random Number Generators
نویسنده
چکیده
The first option here is not easy. Some pieces of data of this kind exist, for example from the decay of radioactive elements, but generally generation is slow and you cannot get the quantity of random numbers you require for modern applications. The second option here is what I’ll talk about today. Algorithms of this type are called “PseudoRandom Number Generators” (PRNGs). Many bad algorithms exist, in the sense that they generate numbers which can fairly readily be distinguished as having a pattern, and not being from a truly random process. I will discuss some of these issues and also outline the algorithms for some famous PRNGs, both good and bad. I’ll focus on PRNGs for generating pseudo-random numbers from the uniform distrubution on the interval [0, 1]. It is fairly easy to transform these for a different distribution if required.
منابع مشابه
The use of non-commutative algebra in cryptographically secure pseudo-random number generators
This thesis begins with a general overview of pseudo-random number generators and some of their applications. This thesis then describes their applications to cryptography, and some additional requirements imposed by cryptography. This thesis then provides an introduction to the ring of quaternions, and discusses how they can be included in pseudo-random number generators. Finally, this thesis ...
متن کاملFast and Reliable Random Number Generators for Scientific Computing
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کاملRandom Numbers in Scientific Computing: An Introduction
Random numbers play a crucial role in science and industry. Many numerical methods require the use of random numbers, in particular the Monte Carlo method. Therefore it is of paramount importance to have efficient random number generators. The differences, advantages and disadvantages of true and pseudo random number generators are discussed with an emphasis on the intrinsic details of modern a...
متن کاملFast and Reliable Random Number Generators
Fast and reliable pseudo-random number generators are required for simulation and other applications in Scientific Computing. We outline the requirements for good uniform random number generators, and describe a class of generators having very fast vector/parallel implementations with excellent statistical properties. We also discuss the problem of initialising random number generators, and con...
متن کاملEvaluation of splittable pseudo-random generators
Pseudo-random number generation is a fundamental problem in computer programming. In the case of sequential processing the problem is very well researched, but parallel processing raises new problems whereof far too little is currently understood. Splittable pseudo-random generators (S-PRNG) have been proposed to meet the challenges of parallelism. While applicable to any programming paradigm, ...
متن کاملQuasi- versus Pseudo-random Generators: Discrepancy, Complexity and Integration-error Based Comparison
Presented here are several quasiand pseudo-random number generators along with their numerical discrepancy, i.e., nonuniformity measure and computational/ time complexity. These generators have been compared and ranked based on discrepancy, complexity, and error in multiple Monte Carlo integrations. We believe that such a statistical comparison/ranking will be useful for solving real world prob...
متن کامل